Spectral Schur Complement Techniques for Symmetric Eigenvalue Problems

نویسندگان

  • VASSILIS KALANTZIS
  • RUIPENG LI
چکیده

This paper presents a Domain Decomposition-type method for solving real symmetric (or Hermitian complex) eigenvalue problems in which we seek all eigenpairs in an interval [α, β], or a few eigenpairs next to a given real shift ζ. A Newton-based scheme is described whereby the problem is converted to one that deals with the interface nodes of the computational domain. This approach relies on the fact that the inner solves related to each local subdomain are relatively inexpensive. This Newton scheme exploits spectral Schur complements and these lead to so-called eigen-branches, which are rational functions whose roots are eigenvalues of the original matrix. Theoretical and practical aspects of domain decomposition techniques for computing eigenvalues and eigenvectors are discussed. A parallel implementation is presented and its performance on distributed computing environments is illustrated by means of a few numerical examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Midwest Numerical Analysis Day 2016 Contributed Talks Theoretical and numerical approximations of the singularly perturbed convection-diffusion equations

We explore singularly perturbed convection-diffusion equations in a circular domain. Considering boundary layer analysis of the singularly perturbed equations and we show convergence results. In view of numerical analysis, We discuss approximation schemes, error estimates and numerical computations. To resolve the oscillations of classical numerical solutions due to the stiffness of our problem...

متن کامل

Probing Methods for Saddle-point Problems

Abstract. Several Schur complement-based preconditioners have been proposed for solving (generalized) saddle-point problems. We consider matrices where the Schur complement has rapid decay over some graph known a priori. This occurs for many matrices arising from the discretization of systems of partial differential equations, and this graph is then related to the mesh. We propose the use of pr...

متن کامل

No . UIUCDCS - R - 2005 - 2540 UILU - ENG - 2005 - 1744 Probing Methods for Generalized Saddle - Point Problems

Several Schur complement-based preconditioners have been proposed for solving (generalized) saddlepoint problems. We consider probing-based methods for approximating those Schur complements in the preconditioners of the type proposed by [Murphy, Golub and Wathen ’00], [de Sturler and Liesen ’03] and [Siefert and de Sturler ’04]. This approach can be applied in similar preconditioners as well. W...

متن کامل

Probing Methods for Generalized Saddle-Point Problems

Several Schur complement-based preconditioners have been proposed for solving (generalized) saddlepoint problems. We consider probing-based methods for approximating those Schur complements in the preconditioners of the type proposed by [Murphy, Golub and Wathen ’00], [de Sturler and Liesen ’03] and [Siefert and de Sturler ’04]. This approach can be applied in similar preconditioners as well. W...

متن کامل

An Analysis of Low-rankmodifications of Preconditioners for Saddle Point Systems

We characterize the spectral behavior of a primal Schur-complement-based block diagonal preconditioner for saddle point systems, subject to low-rank modifications. This is motivated by a desire to reduce as much as possible the computational cost of matrix-vector products with the (1,1) block, while keeping the eigenvalues of the preconditioned matrix reasonably clustered. The formulation leads...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015